package com.leetcode.algorithm.y22.todo;

import com.leetcode.algorithm.common.TreeNode;

/**
 * 889. 根据前序和后序遍历构造二叉树
 * 
 * @author jie.deng
 *
 */
class Question0889Solution01 {

	public TreeNode constructFromPrePost(int[] preorder, int[] postorder) {
		return null;
	}

}